Some Linear Complexity Profiles of Finite Sequences
نویسندگان
چکیده
منابع مشابه
Linear Complexity of Finite Field Sequences over Different Fields
In this paper we study relationships between the linear complexities of a sequence when treated as a sequence over two distinct fields. We obtain bounds for one linear complexity in the form of a constant multiple of the other, where the constant depends only on the fields, not on the particular sequence. key words: Linear complexity, stream cipher, finite field, pseudorandom sequence.
متن کاملCoding Theory using Linear Complexity of Finite Sequences
As we will explain in this section, the notion of weight of vectors are closely related to notion of linear complexity of the sequence. This motivates us to study the linear complexity of sequences as a new metric. For us to see this relation, let us first recall some notion from linear coding theory using the Hamming metric. In most part of this work, unless otherwise specified, we will always...
متن کاملLinear Complexity of Some Binary Interleaved Sequences of Period 4N
It is necessary that the linear complexity of a key stream sequence in a stream cipher system is not less than half of a period. This paper puts forward the linear complexity of a class of binary interleaved sequences with period 4N over the finite field with characteristic 2. Results show that the linear complexity of some of these sequences satisfies the requirements of cryptography.
متن کاملLinear complexity of transformed sequences
This paper deals with the effect of bit change errors on the linear complexity of finite sequences. Though a change in a single bit can cause a large change in linear complexity, it is shown that on the average the change will be small even when many bits, e.g. 10%, are changed. General bijections on the set of sequences of length n are studied and tight bounds are found on the average differen...
متن کاملFinite Inductive Sequences, Kolmogorov Complexity with Application to Genome Sequences
We describe current work in examining the complexity of genomic sequences at the amino acid level. We have provided an original algorithm description and research results when considering this algorithm as a measure of Kolmogorov complexity of such candidate strings. The results can be used to estimate comparative string values, identifying substrings with comparable values, and determining reg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Institute of Systems, Control and Information Engineers
سال: 1992
ISSN: 1342-5668,2185-811X
DOI: 10.5687/iscie.5.325